package com.leetcode.partition12;

import java.util.Arrays;

/**
 * @author `RKC`
 * @date 2021/9/14 22:21
 */
public class LC1137第N个泰波那契数 {

    public static int tribonacci(int n) {
        return dynamicProgramming(n);
    }

    public static void main(String[] args) {
        System.out.println(tribonacci(4));
    }

    private static int dynamicProgramming(int n) {
        if (n == 0) return 0;
        if (n == 1 || n == 2) return 1;
        int[] dp = new int[n + 1];
        dp[0] = 0;
        dp[1] = 1;
        dp[2] = 1;
        for (int i = 3; i <= n; i++) {
            dp[i] = dp[i - 1] + dp[i - 2] + dp[i - 3];
        }
        System.out.println(Arrays.toString(dp));
        return dp[n];
    }
}
